A tight lower bound for semi-synchronous collaborative grid exploration
نویسندگان
چکیده
منابع مشابه
Tight Bounds for Asynchronous Collaborative Grid Exploration
Consider a small group of mobile agents whose goal is to locate a certain cell in a two-dimensional infinite grid. The agents operate in an asynchronous environment, where in each discrete time step, an arbitrary subset of the agents execute one atomic look-compute-move cycle. The protocol controlling each agent is determined by a (possibly distinct) finite automaton. The only means of communic...
متن کاملA General Lower Bound for Collaborative Tree Exploration
We consider collaborative graph exploration with a set of k agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other vertices. We assume agents are deterministic, vertices are distinguishable, moves are simultaneous, and we allow agents to communicate globally. For this setting, we give the first non-trivial lower bounds that bridge the ...
متن کاملA Tight Lower Bound for Processor Coordination
We prove a tight lower bound on the running time of oblivious solutions to k set agreement In k set agreement processors start with input values from a given set and choose output values from the same set In every execution the set of output values must be contained in the set of input values and the set of output values must have size at most k A solution is oblivious if it does not make use o...
متن کاملA Tight Lower Bound for Streett Complementation
Finite automata on infinite words (ω-automata) proved to be a powerful weapon for mod-eling and reasoning infinite behaviors of reactive systems. Complementation of ω-automata iscrucial in many of these applications. But the problem is non-trivial; even after extensive studyduring the past two decades, we still have an important type of ω-automata, namely Streettautomata, for wh...
متن کاملA Model for Semi-(a)Synchronous Collaborative Editing
This paper presents a new model lor semi-synchronous collaborative editing. It fills the gap between asynchronous and synchronous editing styles. The model is based on hierarchically partitioned documents, fine-grained version control, and a mechanism called active cliffs for supplying collaboration awareness. The aim of the model is to provide an editing style that better suits the way people ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2020
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-020-00369-0